Linear semiprime (p;q) radicals

A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees

This paper presents a simple linear algorithm for embedding (or drawing) a planar graph in the plane. The algorithm is based on the “vertex-addition” algorithm of Lempel, Even, and Cederbaum (“Theory of Graphs,” Intl. Sympos. Rome, July 1966, pp. 21>232, Gordon & Breach, New York, 1967) for the planarity testing, and is a modification of Booth and Lueker’s (J. Comput. System Sci. 13 (1976), 335...

Centralizers on semiprime rings

The main result: Let R be a 2-torsion free semiprime ring and let T : R → R be an additive mapping. Suppose that T (xyx) = xT (y)x holds for all x, y ∈ R. In this case T is a centralizer.

Semiprime Ideals and Separation Theorem in Posets

Centralizers on prime and semiprime rings

The purpose of this paper is to investigate identities satisfied by centralizers on prime and semiprime rings. We prove the following result: Let R be a noncommutative prime ring of characteristic different from two and let S and T be left centralizers on R. Suppose that [S(x), T (x)]S(x) + S(x)[S(x), T (x)] = 0 is fulfilled for all x ∈ R. If S 6= 0 (T 6= 0) then there exists λ from the extende...

Fuzzy semiprime ideals in -rings

In this paper, T. K. Dutta`s and S. K. Sardar`s semiprime ideal of -rings as a fuzzy semiprime ideal of a -rings via its operator rings was defined. Some characterizations of fuzzy semiprime ideal of -rings was obtained. That is; a characterization prove of a fuzzy semiprime ideal, the relationship between fuzzy semiprime ideal and fuzzy prime ideal was obtained. If is fuzzy semiprime ideal of ...